1561B - Charmed by the Game - CodeForces Solution


brute force math *1300

Please click on ads to support us..

Python Code:

import sys
from sys import stdout

input = sys.stdin.readline
inf = float('inf')


def getInt():
    return int(input())


def getStr():
    return input().strip()


def getList(split=True):
    s = getStr()
    if split:
        s = s.split()
    return list(map(int, s))



t = getInt()


def solve():
    a, b = getList()
    n = a+b
    res = set()
    for hold in {n >> 1, n+1 >> 1}:
        for Break in range(min(n-hold, a)+1):
            if 0 <= hold - a + Break <= b:
                res.add(2*Break+hold-a)
    print(len(res))
    print(*sorted(res))


for _ in range(t):
    solve()


Comments

Submit
0 Comments
More Questions

1466B - Last minute enhancements
450B - Jzzhu and Sequences
1582C - Grandma Capa Knits a Scarf
492A - Vanya and Cubes
217A - Ice Skating
270A - Fancy Fence
181A - Series of Crimes
1638A - Reverse
1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness
1649A - Game
139A - Petr and Book
1612A - Distance
520A - Pangram
124A - The number of positions
1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers